Construction of Additive Reed-Muller Codes
نویسندگان
چکیده
The well known Plotkin construction is, in the current paper, generalized and used to yield new families of Z2Z4-additive codes, whose length, dimension as well as minimum distance are studied. These new constructions enable us to obtain families of Z2Z4-additive codes such that, under the Gray map, the corresponding binary codes have the same parameters and properties as the usual binary linear Reed-Muller codes. Moreover, the first family is the usual binary linear Reed-Muller family.
منابع مشابه
Robust Reed Solomon Coded MPSK Modulation
In this paper, construction of partitioned Reed Solomon coded modulation (RSCM), which is robust for the additive white Gaussian noise channel and a Rayleigh fading channel, is investigated. By matching configuration of component codes with the channel characteristics, it is shown that this system is robust for the Gaussian and a Rayleigh fading channel. This approach is compared with non-parti...
متن کاملReed-Muller codes: Projections onto GF (4) and multilevel construction
A projection of binary Reed–Muller codes ( ) onto GF (4) is presented. For an ( ) code, this operation yields a linear quaternary code with the same length, dimension, and minimum distance as the Reed–Muller ( 1 2) code. Based upon this projection, multilevel construction is given for ( ), where the constituent codes applied to the different levels are themselves the Reed–Muller codes ( 2 2) an...
متن کاملList Decoding of Reed-Muller Codes Based on a Generalized Plotkin Construction
Gopalan, Klivans, and Zuckerman proposed a listdecoding algorithm for Reed-Muller codes. Their algorithm works up to a given list-decoding radius. Dumer, Kabatiansky, and Tavernier improved the complexity of the algorithm for binary Reed-Muller codes by using the well-known Plotkin construction. In this study, we propose a list-decoding algorithm for non-binary Reed-Muller codes as a generaliza...
متن کاملThe Generalized Reed-Muller codes in a modular group algebra
First we study some properties of the modular group algebra Fpr [G] where G is the additive group of a Galois ring of characteristic pr and Fpr is the field of p r elements. Secondly a description of the Generalized Reed-Muller codes over Fpr in Fpr [G] is presented.
متن کاملList Decoding for Reed-Muller Codes and Its Application to Polar Codes
Gopalan, Klivans, and Zuckerman proposed a list-decoding algorithm for Reed-Muller codes. Their algorithm works up to a given list-decoding radius. Dumer, Kabatiansky, and Tavernier improved the complexity of the algorithm for binary Reed-Muller codes by using wellknown Plotkin construction. In this study, we propose a list-decoding algorithm for non-binary Reed-Muller codes as a natural genera...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009